A new fractal image coding scheme employing blocks of variable shapes

نویسندگان

  • Masayuki Tanimoto
  • Hiroshi Ohyama
  • Tadahiko Kimoto
  • Sakae Katsuyama
  • Toshiaki Fujii
چکیده

In the fractal coding schemes proposed so far based on Iterated Function Systems, an image is represented by a self-affine set of square blocks. In this paper, we propose a scheme of fractal image coding with blocks of variable shapes. In this scheme, the range blocks are determined by so-called splitting-and-merging method. Also, we define two kinds of range blocks, shade blocks and non-shade blocks, according to the variance of brightness level inside blocks. By this method, range blocks both of various size and of various shapes are extracted from an input image. The larger range blocks result in the more reduction of the total number of blocks and, hence, the amount of encoded bits. Because of the specified order used in merging of primitive blocks, only a few more bits are added for each range block to encode its shape. The results of computer simulation with a test gray-scale image show that compared with the conventional scheme using square range blocks, the proposed coding scheme reduces about 0.2 bits/pel to achieve the almost same reproduced quality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visual Pattern Image Coding by a Morphological Approach (RESEARCH NOTE)

This paper presents an improvement of the Visual Pattern image coding (VPIC) scheme presented by Chen and Bovik in [2] and [3]. The patterns in this improved scheme are defined by morphological operations and classified by absolute error minimization. The improved scheme identifies more uniform blocks and reduces the noise effect. Therefore, it improves the compression ratio and image quality i...

متن کامل

Fractal Image Coding a New Approach with Chain Codes

Fractal image coding, the traditional approaches which are being used currently, based on dividing the images into blocks. These blocks are known as range blocks and domain blocks. In these approaches after coding the image generally the decoding process is slow as extensive searching is required .In this paper we are going to present a scheme which uses the concept of chain codes through which...

متن کامل

Faster fractal image compression using quadtree recomposition

In this paper, we present a fractal image compression algorithm employing a new quadtree recomposition (QR) approach. In this approach, quadtree subblocks of an image are iteratively recombined into larger blocks for fractal coding. For complex images, this approach exhibits superior runtime performance, when compared to a classical quadtree decomposition (QD) scheme, while maintaining high del...

متن کامل

Hierarchical Interpretation of Fractal Image Coding and Its Application to Fast Decoding

The basics of a block oriented fractal image coder, are described. The output of the coder is an IFS (Iterated Function System) code, which describes the image as a xed-point of a contractive transformation. A new hierarchical interpretation of the IFS code, which relates diierent scales of the xed-point to the code, is presented and proved. The proof is based on nding a function of a continuou...

متن کامل

Fractal image compression with region-based functionality

Region-based functionality offered by the MPEG-4 video compression standard is also appealing for still images, for example to permit object-based queries of a still-image database. A popular method for still-image compression is fractal coding. However, traditional fractal image coding uses rectangular range and domain blocks. Although new schemes have been proposed that merge small blocks int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996